Complete and non-overlapping marching along a closed regular intersection curve
نویسندگان
چکیده
In this paper we present an algorithm for estimating the rotation index of a closed regular intersection curve from its singular points. On the basis of this index we have also devised a procedure that guarantees that a closed intersection curve will be traced completely, without overlapping. Combining this procedure with marching steps derived from differential geometric properties has resulted in a robust intersection technique.
منابع مشابه
Complete and non - overlapping marching along a closed regular intersection curve ? Wu , Shin - Ting
In this paper we present an algorithm for estimating the rotation index of a closed regular intersection curve from its singular points. On the basis of this index we have also devised a procedure that guarantees that a closed intersection curve will be traced completely, without overlapping. Combining this procedure with marching steps derived from differential geometric properties has resulte...
متن کاملOther marching direction of third order
The main motivation of this work is the problem of compute intersection curve between two surface. The surface/surface intersection, is a fundamental problem in computational geometry and geometric modelling of complex shapes. In general surface intersections, the most commonly used methods include subdivision and marching. Marching-based algorithms begin by finding a starting point on the inte...
متن کاملExtraction of Intersection curves from Iso-surfaces on co-located 3D grids
This paper presents new methods for efficient extraction of intersection curves between iso-surfaces of any pair of co-located 3D scalar fields. The first method is based on the Marching Cubes algorithm which has been enhanced to produce an additional data structure that makes it possible to reduce the complexity of the general surface intersection extraction from O(N) to O( √ N), where N denot...
متن کاملAn E cient Surface Intersection Algorithm based on Lower Dimensional Formulation
We present an e cient algorithm to compute the intersection of algebraic and NURBS surfaces Our approach is based on combining the marching methods with the algebraic formulation In particular we use a matrix representation of the intersection curve and compute it accurately using matrix computations We also present algorithms to compute a start point on each component of the intersection curve...
متن کاملAn Eecient Surface Intersection Algorithm Based on Lower Dimensional Formulation
We present an eecient algorithm to compute the intersection of algebraic and NURBS surfaces. Our approach is based on combining the marching methods with the algebraic formulation. In particular, we use a matrix representation of the intersection curve and compute it accurately using matrix computations. We also present algorithms to compute a start point on each component of the intersection c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Graphics
دوره 26 شماره
صفحات -
تاریخ انتشار 2002